(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
active(from(X)) → mark(cons(X, from(s(X))))
active(after(0, XS)) → mark(XS)
active(after(s(N), cons(X, XS))) → mark(after(N, XS))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(after(X1, X2)) → after(active(X1), X2)
active(after(X1, X2)) → after(X1, active(X2))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
after(mark(X1), X2) → mark(after(X1, X2))
after(X1, mark(X2)) → mark(after(X1, X2))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(after(X1, X2)) → after(proper(X1), proper(X2))
proper(0) → ok(0)
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
after(ok(X1), ok(X2)) → ok(after(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Rewrite Strategy: FULL
(1) DecreasingLoopProof (EQUIVALENT transformation)
The following loop(s) give(s) rise to the lower bound Ω(n1):
The rewrite sequence
from(mark(X)) →+ mark(from(X))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [X / mark(X)].
The result substitution is [ ].
(2) BOUNDS(n^1, INF)
(3) RenamingProof (EQUIVALENT transformation)
Renamed function symbols to avoid clashes with predefined symbol.
(4) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
active(from(X)) → mark(cons(X, from(s(X))))
active(after(0', XS)) → mark(XS)
active(after(s(N), cons(X, XS))) → mark(after(N, XS))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(after(X1, X2)) → after(active(X1), X2)
active(after(X1, X2)) → after(X1, active(X2))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
after(mark(X1), X2) → mark(after(X1, X2))
after(X1, mark(X2)) → mark(after(X1, X2))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(after(X1, X2)) → after(proper(X1), proper(X2))
proper(0') → ok(0')
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
after(ok(X1), ok(X2)) → ok(after(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
S is empty.
Rewrite Strategy: FULL
(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)
Infered types.
(6) Obligation:
TRS:
Rules:
active(from(X)) → mark(cons(X, from(s(X))))
active(after(0', XS)) → mark(XS)
active(after(s(N), cons(X, XS))) → mark(after(N, XS))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
active(after(X1, X2)) → after(active(X1), X2)
active(after(X1, X2)) → after(X1, active(X2))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
after(mark(X1), X2) → mark(after(X1, X2))
after(X1, mark(X2)) → mark(after(X1, X2))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(after(X1, X2)) → after(proper(X1), proper(X2))
proper(0') → ok(0')
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
after(ok(X1), ok(X2)) → ok(after(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: mark:0':ok → mark:0':ok
from :: mark:0':ok → mark:0':ok
mark :: mark:0':ok → mark:0':ok
cons :: mark:0':ok → mark:0':ok → mark:0':ok
s :: mark:0':ok → mark:0':ok
after :: mark:0':ok → mark:0':ok → mark:0':ok
0' :: mark:0':ok
proper :: mark:0':ok → mark:0':ok
ok :: mark:0':ok → mark:0':ok
top :: mark:0':ok → top
hole_mark:0':ok1_0 :: mark:0':ok
hole_top2_0 :: top
gen_mark:0':ok3_0 :: Nat → mark:0':ok
(7) OrderProof (LOWER BOUND(ID) transformation)
Heuristically decided to analyse the following defined symbols:
active,
cons,
from,
s,
after,
proper,
topThey will be analysed ascendingly in the following order:
cons < active
from < active
s < active
after < active
active < top
cons < proper
from < proper
s < proper
after < proper
proper < top
(8) Obligation:
TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
after(
0',
XS)) →
mark(
XS)
active(
after(
s(
N),
cons(
X,
XS))) →
mark(
after(
N,
XS))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
after(
X1,
X2)) →
after(
active(
X1),
X2)
active(
after(
X1,
X2)) →
after(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
after(
mark(
X1),
X2) →
mark(
after(
X1,
X2))
after(
X1,
mark(
X2)) →
mark(
after(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
after(
X1,
X2)) →
after(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
after(
ok(
X1),
ok(
X2)) →
ok(
after(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':ok → mark:0':ok
from :: mark:0':ok → mark:0':ok
mark :: mark:0':ok → mark:0':ok
cons :: mark:0':ok → mark:0':ok → mark:0':ok
s :: mark:0':ok → mark:0':ok
after :: mark:0':ok → mark:0':ok → mark:0':ok
0' :: mark:0':ok
proper :: mark:0':ok → mark:0':ok
ok :: mark:0':ok → mark:0':ok
top :: mark:0':ok → top
hole_mark:0':ok1_0 :: mark:0':ok
hole_top2_0 :: top
gen_mark:0':ok3_0 :: Nat → mark:0':ok
Generator Equations:
gen_mark:0':ok3_0(0) ⇔ 0'
gen_mark:0':ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':ok3_0(x))
The following defined symbols remain to be analysed:
cons, active, from, s, after, proper, top
They will be analysed ascendingly in the following order:
cons < active
from < active
s < active
after < active
active < top
cons < proper
from < proper
s < proper
after < proper
proper < top
(9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol cons.
(10) Obligation:
TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
after(
0',
XS)) →
mark(
XS)
active(
after(
s(
N),
cons(
X,
XS))) →
mark(
after(
N,
XS))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
after(
X1,
X2)) →
after(
active(
X1),
X2)
active(
after(
X1,
X2)) →
after(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
after(
mark(
X1),
X2) →
mark(
after(
X1,
X2))
after(
X1,
mark(
X2)) →
mark(
after(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
after(
X1,
X2)) →
after(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
after(
ok(
X1),
ok(
X2)) →
ok(
after(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':ok → mark:0':ok
from :: mark:0':ok → mark:0':ok
mark :: mark:0':ok → mark:0':ok
cons :: mark:0':ok → mark:0':ok → mark:0':ok
s :: mark:0':ok → mark:0':ok
after :: mark:0':ok → mark:0':ok → mark:0':ok
0' :: mark:0':ok
proper :: mark:0':ok → mark:0':ok
ok :: mark:0':ok → mark:0':ok
top :: mark:0':ok → top
hole_mark:0':ok1_0 :: mark:0':ok
hole_top2_0 :: top
gen_mark:0':ok3_0 :: Nat → mark:0':ok
Generator Equations:
gen_mark:0':ok3_0(0) ⇔ 0'
gen_mark:0':ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':ok3_0(x))
The following defined symbols remain to be analysed:
from, active, s, after, proper, top
They will be analysed ascendingly in the following order:
from < active
s < active
after < active
active < top
from < proper
s < proper
after < proper
proper < top
(11) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol from.
(12) Obligation:
TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
after(
0',
XS)) →
mark(
XS)
active(
after(
s(
N),
cons(
X,
XS))) →
mark(
after(
N,
XS))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
after(
X1,
X2)) →
after(
active(
X1),
X2)
active(
after(
X1,
X2)) →
after(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
after(
mark(
X1),
X2) →
mark(
after(
X1,
X2))
after(
X1,
mark(
X2)) →
mark(
after(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
after(
X1,
X2)) →
after(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
after(
ok(
X1),
ok(
X2)) →
ok(
after(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':ok → mark:0':ok
from :: mark:0':ok → mark:0':ok
mark :: mark:0':ok → mark:0':ok
cons :: mark:0':ok → mark:0':ok → mark:0':ok
s :: mark:0':ok → mark:0':ok
after :: mark:0':ok → mark:0':ok → mark:0':ok
0' :: mark:0':ok
proper :: mark:0':ok → mark:0':ok
ok :: mark:0':ok → mark:0':ok
top :: mark:0':ok → top
hole_mark:0':ok1_0 :: mark:0':ok
hole_top2_0 :: top
gen_mark:0':ok3_0 :: Nat → mark:0':ok
Generator Equations:
gen_mark:0':ok3_0(0) ⇔ 0'
gen_mark:0':ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':ok3_0(x))
The following defined symbols remain to be analysed:
s, active, after, proper, top
They will be analysed ascendingly in the following order:
s < active
after < active
active < top
s < proper
after < proper
proper < top
(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol s.
(14) Obligation:
TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
after(
0',
XS)) →
mark(
XS)
active(
after(
s(
N),
cons(
X,
XS))) →
mark(
after(
N,
XS))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
after(
X1,
X2)) →
after(
active(
X1),
X2)
active(
after(
X1,
X2)) →
after(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
after(
mark(
X1),
X2) →
mark(
after(
X1,
X2))
after(
X1,
mark(
X2)) →
mark(
after(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
after(
X1,
X2)) →
after(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
after(
ok(
X1),
ok(
X2)) →
ok(
after(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':ok → mark:0':ok
from :: mark:0':ok → mark:0':ok
mark :: mark:0':ok → mark:0':ok
cons :: mark:0':ok → mark:0':ok → mark:0':ok
s :: mark:0':ok → mark:0':ok
after :: mark:0':ok → mark:0':ok → mark:0':ok
0' :: mark:0':ok
proper :: mark:0':ok → mark:0':ok
ok :: mark:0':ok → mark:0':ok
top :: mark:0':ok → top
hole_mark:0':ok1_0 :: mark:0':ok
hole_top2_0 :: top
gen_mark:0':ok3_0 :: Nat → mark:0':ok
Generator Equations:
gen_mark:0':ok3_0(0) ⇔ 0'
gen_mark:0':ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':ok3_0(x))
The following defined symbols remain to be analysed:
after, active, proper, top
They will be analysed ascendingly in the following order:
after < active
active < top
after < proper
proper < top
(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol after.
(16) Obligation:
TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
after(
0',
XS)) →
mark(
XS)
active(
after(
s(
N),
cons(
X,
XS))) →
mark(
after(
N,
XS))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
after(
X1,
X2)) →
after(
active(
X1),
X2)
active(
after(
X1,
X2)) →
after(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
after(
mark(
X1),
X2) →
mark(
after(
X1,
X2))
after(
X1,
mark(
X2)) →
mark(
after(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
after(
X1,
X2)) →
after(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
after(
ok(
X1),
ok(
X2)) →
ok(
after(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':ok → mark:0':ok
from :: mark:0':ok → mark:0':ok
mark :: mark:0':ok → mark:0':ok
cons :: mark:0':ok → mark:0':ok → mark:0':ok
s :: mark:0':ok → mark:0':ok
after :: mark:0':ok → mark:0':ok → mark:0':ok
0' :: mark:0':ok
proper :: mark:0':ok → mark:0':ok
ok :: mark:0':ok → mark:0':ok
top :: mark:0':ok → top
hole_mark:0':ok1_0 :: mark:0':ok
hole_top2_0 :: top
gen_mark:0':ok3_0 :: Nat → mark:0':ok
Generator Equations:
gen_mark:0':ok3_0(0) ⇔ 0'
gen_mark:0':ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':ok3_0(x))
The following defined symbols remain to be analysed:
active, proper, top
They will be analysed ascendingly in the following order:
active < top
proper < top
(17) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol active.
(18) Obligation:
TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
after(
0',
XS)) →
mark(
XS)
active(
after(
s(
N),
cons(
X,
XS))) →
mark(
after(
N,
XS))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
after(
X1,
X2)) →
after(
active(
X1),
X2)
active(
after(
X1,
X2)) →
after(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
after(
mark(
X1),
X2) →
mark(
after(
X1,
X2))
after(
X1,
mark(
X2)) →
mark(
after(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
after(
X1,
X2)) →
after(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
after(
ok(
X1),
ok(
X2)) →
ok(
after(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':ok → mark:0':ok
from :: mark:0':ok → mark:0':ok
mark :: mark:0':ok → mark:0':ok
cons :: mark:0':ok → mark:0':ok → mark:0':ok
s :: mark:0':ok → mark:0':ok
after :: mark:0':ok → mark:0':ok → mark:0':ok
0' :: mark:0':ok
proper :: mark:0':ok → mark:0':ok
ok :: mark:0':ok → mark:0':ok
top :: mark:0':ok → top
hole_mark:0':ok1_0 :: mark:0':ok
hole_top2_0 :: top
gen_mark:0':ok3_0 :: Nat → mark:0':ok
Generator Equations:
gen_mark:0':ok3_0(0) ⇔ 0'
gen_mark:0':ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':ok3_0(x))
The following defined symbols remain to be analysed:
proper, top
They will be analysed ascendingly in the following order:
proper < top
(19) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol proper.
(20) Obligation:
TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
after(
0',
XS)) →
mark(
XS)
active(
after(
s(
N),
cons(
X,
XS))) →
mark(
after(
N,
XS))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
after(
X1,
X2)) →
after(
active(
X1),
X2)
active(
after(
X1,
X2)) →
after(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
after(
mark(
X1),
X2) →
mark(
after(
X1,
X2))
after(
X1,
mark(
X2)) →
mark(
after(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
after(
X1,
X2)) →
after(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
after(
ok(
X1),
ok(
X2)) →
ok(
after(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':ok → mark:0':ok
from :: mark:0':ok → mark:0':ok
mark :: mark:0':ok → mark:0':ok
cons :: mark:0':ok → mark:0':ok → mark:0':ok
s :: mark:0':ok → mark:0':ok
after :: mark:0':ok → mark:0':ok → mark:0':ok
0' :: mark:0':ok
proper :: mark:0':ok → mark:0':ok
ok :: mark:0':ok → mark:0':ok
top :: mark:0':ok → top
hole_mark:0':ok1_0 :: mark:0':ok
hole_top2_0 :: top
gen_mark:0':ok3_0 :: Nat → mark:0':ok
Generator Equations:
gen_mark:0':ok3_0(0) ⇔ 0'
gen_mark:0':ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':ok3_0(x))
The following defined symbols remain to be analysed:
top
(21) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol top.
(22) Obligation:
TRS:
Rules:
active(
from(
X)) →
mark(
cons(
X,
from(
s(
X))))
active(
after(
0',
XS)) →
mark(
XS)
active(
after(
s(
N),
cons(
X,
XS))) →
mark(
after(
N,
XS))
active(
from(
X)) →
from(
active(
X))
active(
cons(
X1,
X2)) →
cons(
active(
X1),
X2)
active(
s(
X)) →
s(
active(
X))
active(
after(
X1,
X2)) →
after(
active(
X1),
X2)
active(
after(
X1,
X2)) →
after(
X1,
active(
X2))
from(
mark(
X)) →
mark(
from(
X))
cons(
mark(
X1),
X2) →
mark(
cons(
X1,
X2))
s(
mark(
X)) →
mark(
s(
X))
after(
mark(
X1),
X2) →
mark(
after(
X1,
X2))
after(
X1,
mark(
X2)) →
mark(
after(
X1,
X2))
proper(
from(
X)) →
from(
proper(
X))
proper(
cons(
X1,
X2)) →
cons(
proper(
X1),
proper(
X2))
proper(
s(
X)) →
s(
proper(
X))
proper(
after(
X1,
X2)) →
after(
proper(
X1),
proper(
X2))
proper(
0') →
ok(
0')
from(
ok(
X)) →
ok(
from(
X))
cons(
ok(
X1),
ok(
X2)) →
ok(
cons(
X1,
X2))
s(
ok(
X)) →
ok(
s(
X))
after(
ok(
X1),
ok(
X2)) →
ok(
after(
X1,
X2))
top(
mark(
X)) →
top(
proper(
X))
top(
ok(
X)) →
top(
active(
X))
Types:
active :: mark:0':ok → mark:0':ok
from :: mark:0':ok → mark:0':ok
mark :: mark:0':ok → mark:0':ok
cons :: mark:0':ok → mark:0':ok → mark:0':ok
s :: mark:0':ok → mark:0':ok
after :: mark:0':ok → mark:0':ok → mark:0':ok
0' :: mark:0':ok
proper :: mark:0':ok → mark:0':ok
ok :: mark:0':ok → mark:0':ok
top :: mark:0':ok → top
hole_mark:0':ok1_0 :: mark:0':ok
hole_top2_0 :: top
gen_mark:0':ok3_0 :: Nat → mark:0':ok
Generator Equations:
gen_mark:0':ok3_0(0) ⇔ 0'
gen_mark:0':ok3_0(+(x, 1)) ⇔ mark(gen_mark:0':ok3_0(x))
No more defined symbols left to analyse.